Truth without satisfaction

نویسندگان

  • Kit Fine
  • Timothy McCarthy
چکیده

In his famous paper [7], Tarski gave a definition of truth for a formalized language. Unable to perform a direct recursion on the concept itself, he gave a definition in terms of satisfaction. This makes it natural to ask if such an indirect procedure is necessary or whether a definition of truth can be given without using or somehow invoking the concept of satisfaction. The question, as it stands, is vague; and later we shall be concerned to make it more precise. But even as it stands, it has an obvious technical interest. The situation that Tarski found himself in is common in mathematics. We wish to define a certain concept, but unable to perform a direct recursion on the concept itself we perform a recursion on a related concept of which the given concept is a special case. It would therefore be desirable to know when the related concept is necessary, both in the case of truth and in general. The question may also have some philosophical interest. There is a fundamental difference between the concepts of truth and of satisfaction. The former merely applies to certain linguistic units; the latter connects language to an ontology of objects, typically extra-linguistic. A negative result on defining truth without satisfaction may perhaps constrain formal attempts to implement non-referential conceptions of truth. In the present paper, however, we will not be concerned in detail with the philosophical aspects of our question, although we will from time to time mention some points of contact between our discussion and the philosopltical literature. Interest in our question dates back to Wallace [9]; and the topic was subsequently taken up by Tharp [8] and Kripke [3] (especially Section 10). We have made our presentation self-contained, though the reader may consult the earlier work for general background and for elucidation of particular points. The plan of our paper is as follows. Section 1 sets out the general framework in which our question and its cognates are posed. Section 2 solves the questions in case the meta-theory is not required to be finitely axiomatized;

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth After the Fact in Indeterminist Tense Logic

Branching conceptions of time invoke temporal models in which the same synchronic state is associated with multiple future outcomes. Indeterminist conceptions of time add to this picture the idea that a sentence can be true at a moment with alternative futures only if its truth depends only on the history of things up to and including that moment. In particular, consider an atomic formula p, an...

متن کامل

Truth in the Context of Christian Faith and its Relation to Other Religions

In the following reflections on the understanding of truth in regard to Christian faith (or even in regard to religious faith, experience, and language in general), I advocate a relational interpretation of truth. Truth in that sense is understood not primarily as an intellectual assertion but as a qualification of a dynamic, existential, personal relation. Truth is the trustworthiness of that ...

متن کامل

CONSTRAINT Networks

1 Introduction Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satised. A variety of techniques have been developed for nding partial or complete solutions for dierent kinds of constraint expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth...

متن کامل

Constraint Networks 1

1 Introduction Constraint-based reasoning is a paradigm for formulating knowledge as a set of constraints without specifying the method by which these constraints are to be satised. A variety of techniques have been developed for nding partial or complete solutions for dierent kinds of constraint expressions. These have been successfully applied to diverse tasks such as design, diagnosis, truth...

متن کامل

Adaptive Solving of Equations over Rational Trees

Two variants of an incremental and adaptive uniication algorithm are presented. Both variants decide incrementally the consistency of conjunctions of syntactical equations over rational trees after any additions or deletions of syntactical equations. In the positive case, a rational solved form equivalent to the given conjunction is computed incrementally. Contrary to other incremental implemen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Philosophical Logic

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1984